Generalized Multiobjective Evolutionary Algorithm Guided by Descent Directions

نویسندگان

  • Roman Denysiuk
  • Lino A. Costa
  • Isabel A. Espírito-Santo
چکیده

This paper proposes a generalized descent directions-guided multiobjective algorithm (DDMOA2). DDMOA2 uses the scalarizing fitness assignment in its parent and environmental selection procedures. The population consists of leader and non-leader individuals. Each individual in the population is represented by a tuple containing its genotype as well as the set of strategy parameters. The main novelty and the primary strength of our algorithm is its reproduction operator, which combines the traditional local search and stochastic search techniques. To improve efficiency, when the number of objective is increased, descent directions are found only for two randomly chosen objectives. Furthermore, in order to increase the search pressure in high-dimensional objective space, we impose an additional condition for the acceptance of descent directions found for leaders during local search. The performance of the proposed approach is compared with those produced by representative state-of-the-art multiobjective evolutionary algorithms on a set of problems with up to 8 objectives. The experimental results reveal that our algorithm is able to produce highly competitive results with well-established multiobjective optimizers on all tested problems. Moreover, due to its hybrid reproduction operator, DDMOA2 demonstrates superior performance on multimodal problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Hybrid Evolutionary Multiobjective Algorithm Guided by Descent Directions

Hybridization of local search based algorithms with evolutionary algorithms is still an under-explored research area in multiobjective optimization. In this paper, we propose a new multiobjective algorithm based on a local search method. The main idea is to generate new non-dominated solutions by adding a linear combination of descent directions of the objective functions to a parent solution ....

متن کامل

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Agent-based Evolutionary Multiobjective Optimisation

This work presents a new evolutionary approach to searching for a global solution (in the Pareto sense) to multiobjective optimisation problem. Novelty of the method proposed consists in the application of an evolutionary multi-agent system (EMAS) instead of classical evolutionary algorithms. Decentralisation of the evolution process in EMAS allows for intensive exploration of the search space,...

متن کامل

Evolutionary Multiobjective Optimization for Fuzzy Knowledge Extraction

− A new trend in the design of fuzzy rulebased systems is the use of evolutionary multiobjective optimization (EMO) algorithms. This trend is observed in various areas in machine learning. EMO algorithms are often used to search for a number of Pareto-optimal non-linear systems with respect to their accuracy and complexity. In this paper, we first explain some basic concepts in multiobjective o...

متن کامل

Spiral Optimization Algorithm Using Periodic Descent Directions

A few years ago, the authors proposed a nature-inspired metaheuristic concept, the spiral optimization algorithm, which was inspired by spiral phenomena in nature. The principal idea of the algorithm is to utilize spiral trajectories generated by multiple generalized spiral models for search applications. The generalized spiral model is composed of a spiral matrix defined by a composite rotatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Math. Model. Algorithms in OR

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2014